Termination proof of /tmp/tmpsCsU7b/Ex5_Zan97

Termination of the following Term Rewriting System could be disproven:

Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:

if(false, X) → Y
f(X) → if(X, c)
if(true, X) → X

↳ GTRS

  ↳ CritRuleProof

Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:

if(false, X) → Y
f(X) → if(X, c)
if(true, X) → X

The rule if(false, X) → Y contains free variables in its right-hand side. Hence the TRS is not-terminating.